Lecture Notes in Computer Science 3494
نویسندگان
چکیده
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed how to find collisions of MD4 with complexity equivalent to 2 MD4 hash computations. In this paper, we present a new attack on MD4 which can find a collision with probability 2−2 to 2−6, and the complexity of finding a collision doesn’t exceed 2 MD4 hash operations. Built upon the collision search attack, we present a chosen-message pre-image attack on MD4 with complexity below 2. Furthermore, we show that for a weak message, we can find another message that produces the same hash value. The complexity is only a single MD4 computation, and a random message is a weak message with probability 2−122. The attack on MD4 can be directly applied to RIPEMD which has two parallel copies of MD4, and the complexity of finding a collision is about 2 RIPEMD hash operations.
منابع مشابه
Lecture Notes in Artificial Intelligence 4451 Edited by J . G . Carbonell and J . Siekmann Subseries of Lecture Notes in Computer Science
متن کامل
Progress in Cryptology - AFRICACRYPT 2011 - 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings
information security practice and experience 10th international conference ispec 2014 fuzhou china may 5-8 2014 proceedings lecture notes in computer science security and cryptology PDF advances in cryptology-asiacrypt 96 international conference on the theory and applications of crypotology and information security kyongju lecture notes in computer science PDF image analysis 17th scandinavian ...
متن کامل